Expansion Nets: Proof-Nets for Propositional Classical Logic
نویسنده
چکیده
We give a calculus of proof-nets for classical propositional logic. These nets improve on a proposal due to Robinson by validating the associativity and commutativity of contraction, and provide canonical representants for classical sequent proofs modulo natural equivalences. We present the relationship between sequent proofs and proof-nets as an annotated sequent calculus, deriving formulae decorated with expansion/deletion trees. We then see a subcalculus, expansion nets, which in addition to these good properties has a polynomial-time correctness criterion.
منابع مشابه
Canonical Proof nets for Classical Logic
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that (a) there s...
متن کاملNaming Proofs in Classical Propositional Logic
We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut-elimination procedure. This gives us a “Boolean” cat...
متن کاملFrom Deep Inference to Proof Nets via Cut Elimination
This paper shows how derivations in the deep inference system SKS for classical propositional logic can be translated into proof nets. Since an SKS derivation contains more information about a proof than the corresponding proof net, we observe a loss of information which can be understood as “eliminating bureaucracy”. Technically this is achieved by cut reduction on proof nets. As an intermedia...
متن کاملm at h . L O / 0 50 40 28 v 1 1 A pr 2 00 5 Classical logic = Fibred MLL
Syntactically, classical logic decomposes thus [Gir87]: Classical logic = MLL + Superposition where MLL is Multiplicative Linear Logic, and superposition means contraction (binary case) and weakening (nullary case). Proof nets for classical logic have been proposed [Gir91, Rob03], containing explicit contraction and weakening nodes. Just as the logical sequent rules of conjuction (tensor) and d...
متن کاملClassical Logic = Fibred MLL
Syntactically, classical logic decomposes thus [Gir87]: Classical logic = MLL + Superposition where MLL is Multiplicative Linear Logic, and superposition means contraction (binary case) and weakening (nullary case). Proof nets for classical logic have been proposed [Gir91, Rob03], containing explicit contraction and weakening nodes. Just as the logical sequent rules of conjuction (tensor) and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010